منابع مشابه
Polynomial Path Orders
This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP, that is applicable in two related, but distinct contexts. On the one hand POP induces polynomial innermost runtime complexity and hence may serve as a syntactic, and full...
متن کاملPolynomial Path Orders: A Maximal Model
This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order >pop∗. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feat...
متن کاملDependency Pairs and Polynomial Path Orders
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the functions computed. The established techniques have been implemented and we provide ample experimental data to assess the new method.
متن کاملIterative path orders
In Dershowitz’s original presentation recursive path orders (RPO) are defined by means of recursion. In Bergstra and Klop’s presentation RPOs are operationally defined by means of a set of term rewrite rules. To distinguish the two presentations, we will refer to the latter as iterative path orders (IPO). We show that IPOs as originally defined by Bergstra and Klop are strictly weaker than RPOs...
متن کاملIterative Lexicographic Path Orders
We relate Kamin and Lévy’s original presentation of lexicographic path orders (LPO), using an inductive definition, to a presentation, which we will refer to as iterative lexicographic path orders (ILPO), based on Bergstra and Klop’s definition of recursive path orders by way of an auxiliary term rewriting sytem. Dedicated to Joseph Goguen, in celebration of his 65th birthday.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(4:9)2013